Dlp Sponge Construction for Authenticatedencryption
نویسندگان
چکیده
In this paper, we present a new DLP-sponge construction to ensure integrity and privacy. This scheme solves problem related to small keys by introducing a double length construction: k ≈ 2r. Previous researcher show that the size of key k must be twice of the capacity c which will in turn affect the size of the underlying permutation: b = c + r. As c decreases, the bitrate r increases as well. Besides that, our scheme is resistant against most of the generic attacks such as multicollision attack with a complexity of t.2 2(c+3)\2 . Therefore, our scheme is better than some of the existing Authenticated Encryption (AE) schemes.
منابع مشابه
A review of Dolochar reuse methods (waste from sponge iron factories)
Background and Objective: Dolochar is the residual ash from the production of sponge iron in the process of direct reduction of iron ore by the coal-based method. In Iran, this waste is transported to the nearest landfill. However, these methods are a major environmental concern due to the fineness of the waste and the presence of heavy metals in its composition. The aim of the present study is...
متن کاملCollapsing sponges: Post-quantum security of the sponge construction
We investigate the post-quantum security of hash functions based on the sponge construction. A crucial property for hash functions in the post-quantum setting is the collapsing property (a strengthening of collision-resistance). We show that the sponge construction is collapsing (and in consequence quantum collision-resistant) under suitable assumptions about the underlying block function. In p...
متن کاملPost-quantum Security of the Sponge Construction
We investigate the post-quantum security of hash functions based on the sponge construction. A crucial property for hash functions in the post-quantum setting is the collapsing property (a strengthening of collision-resistance). We show that the sponge construction is collapsing (and in consequence quantum collision-resistant) under suitable assumptions about the underlying block function. In p...
متن کاملSponge-Based Pseudo-Random Number Generators
This paper proposes a new construction for the generation of pseudo-random numbers. The construction is based on sponge functions and is suitable for embedded security devices as it requires few resources. We propose a model for such generators and explain how to define one on top of a sponge function. The construction is a novel way to use a sponge function, and inputs and outputs blocks in a ...
متن کاملA Keyed Sponge Construction with Pseudorandomness in the Standard Model
The sponge construction, designed by Bertoni, Daemen, Peeters, and Ass cheis, is the framework for hash functions such as Keccak, PHOTON, Quark, and spon gent. The designers give a keyed sponge construction by prepending the message with key and prove a bound on its pseudorandomness in the ideal permutation model . In this paper we give a different keyed sponge construction that is based on t...
متن کامل